Optimal three-weight cubic codes
نویسندگان
چکیده
In this paper, we construct an infinite family of three-weight binary codes from linear codes over the ring R = F2+ vF2+ v 2 F2, where v 3 = 1. These codes are defined as trace codes. They have the algebraic structure of abelian codes. Their Lee weight distributions are computed by employing character sums. The three-weight binary linear codes which we construct are shown to be optimal when m is odd and m > 1. They are cubic, that is to say quasi-cyclic of co-index three. An application to secret sharing schemes is given.
منابع مشابه
Some ternary cubic two-weight codes
We study trace codes with defining set L, a subgroup of the multiplicative group of an extension of degree m of the alphabet ring F3+uF3+u 2 F3, with u 3 = 1. These codes are abelian, and their ternary images are quasi-cyclic of co-index three (a.k.a. cubic codes). Their Lee weight distributions are computed by using Gauss sums. These codes have three nonzero weights when m is singly-even and |...
متن کاملOn the weight distributions of optimal cosets of the first-order Reed-Muller codes
We study the weight distributions of cosets of the first-order Reed–Muller code (1 ) for odd , whose minimum weight is greater than or equal to the so-called quadratic bound. Some general restrictions on the weight distribution of a coset of (1 ) are obtained by partitioning its words according to their weight divisibility. Most notably, we show that there are exactly five weight distributions ...
متن کاملA Class of Two-Weight and Three-Weight Linear Codes and Their Duals
The objective of this paper is to construct a class of linear codes with two nonzero weights and three nonzero weights by using the general trace functions, which weight distributions has been determined. These linear codes contain some optimal codes, which meets certain bound on linear codes. The dual codes are also studied and proved to be optimal or almost optimal. These codes may have appli...
متن کاملHanani triple packings and optimal q-ary codes of constant weight three
The exact sizes of optimal q-ary codes of length n, constant weightw and distance d = 2w− 1 have only been determined for q ∈ {2, 3}, and for w|(q − 1)n and n sufficiently large. We completely determine the exact size of optimal q-ary codes of constant weight three and minimum distance five for all q by establishing a connection with Hanani triple packings, and settling their existence.
متن کاملA Search for New Optimal Singly - Even Self - Dual Codes of Length 48
The best binary self-dual singly-even codes of length 48 have minimal weight 10 and are called optimal. There are 75 such codes found by Harada at al. in 2005. We use the method for constructing self-dual codes via automorphism of order three to find 102 optimal self-dual singly-even codes of length 48. We use computer algebra system Magma to construct the codes to compute their weight enumerat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1612.00123 شماره
صفحات -
تاریخ انتشار 2016